Distributed Algorithmic Mechanism Design in P2P File-sharing Networks Literature Survey

Distributed peer-to-peer file-sharing systems rely on voluntary contribution of resources (files and bandwidth) from the individual peers. However, individual rationality and self-interest result in free-riding behavior at the expense of collective welfare. Empirical studies have shown this free-riding to be prevalent. To overcome this, filesharing systems have implemented various mechanisms to improve the sharing of files and bandwidth, with varying results. Although most systems show improvement in cooperation from the peers through these mechanisms, theoretical analysis has shown all these mechanisms are still susceptible to manipulation from peers that improve their own utility at the expense of others. Similar problems arise in distributed systems in general. Recently Distributed Algorithmic Mechanism Design (DAMD), an application of Game Theory and Economics in distributed computing, has been proposed as a method to offer incentives in distributed systems, motivating peers to cooperate with the system. In this survey, we give an overview of DAMD and investigate how it can be applied to file-sharing systems. Additionally, we present an overview of recent literature on offering incentives in file-sharing networks. We present a model for distributed P2P file-sharing based on the Maximum Concurrent Multi-Commodity Flow problem that is used for two things. First, we use it to determine an optimal pattern that specifies which file is downloaded from which agent, and how the file is routed through the network from source to destination, minimizing download time for all agents. Second, we use it to provide incentives to the peers to share files and bandwidth. From our model and the presented literature, we derive solution ideas for designing a truthful distributed mechanism that offers incentives to the peers, motivating them to cooperate with the system.